Dynamic result set caching with a database accelerator

ABSTRACT

According to one embodiment of the present invention, a system for processing a database query stores one or more result sets for one or more first database queries in a data store. The system receives a second database query and compares the second database query to the one or more first database queries to determine presence of a corresponding result set in the data store for the second database query. The system provides the corresponding result set from the data store for the second database query based on the comparison. Embodiments of the present invention further include a method and computer program product for processing a database query in substantially the same manners described above.

BACKGROUND

Present invention embodiments relate to database systems, and morespecifically, to dynamically and asynchronously caching query resultsets of accelerated database queries.

Some database platforms use accelerator systems to improve responsetimes for complex, data-intensive database queries. An acceleratorsystem is typically a supplemental appliance—separate from the primarydatabase system—that includes dedicated hardware for rapid data accessand processing. A portion of the data from the database (e.g., data thatis static or changes infrequently) is loaded into the acceleratorsystem. When the primary database system receives a query against thisdata, it may send the query to the accelerator system, which applies thequery against the previously loaded data and returns a result set to theprimary database system. The primary database system in turn sends theresult set to the user or application that submitted the query. Theaccelerator system may produce results many times faster than theprimary database system would itself. However, the response may stilltake minutes or even hours of processing time.

SUMMARY

According to one embodiment of the present invention, a system forprocessing a database query stores one or more result sets for one ormore first database queries in a data store. The system receives asecond database query and compares the second database query to the oneor more first database queries to determine presence of a correspondingresult set in the data store for the second database query. The systemprovides the corresponding result set from the data store for the seconddatabase query based on the comparison. Embodiments of the presentinvention further include a method and computer program product forprocessing a database query in substantially the same manners describedabove.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

Generally, like reference numerals in the various figures are utilizedto designate like components.

FIG. 1 is a diagrammatic illustration of an example computingenvironment for an embodiment of the present invention.

FIG. 2 is a block diagram of an example accelerator system according toan embodiment of the present invention.

FIG. 3 is a flow diagram illustrating an example manner of responding toa query on an accelerator system according to an embodiment of thepresent invention.

FIG. 4 is a flow diagram illustrating an example manner of updating acache on an accelerator system according to an embodiment of the presentinvention.

FIG. 5 is a flow diagram illustrating an example manner of invalidatingcached results in response to an update of the underlying data on anaccelerator system according to an embodiment of the present invention.

DETAILED DESCRIPTION

Present invention embodiments relate to caching result sets ofaccelerated database queries. For example, an accelerator system maygenerate a result set for a query and write the result set to a file ona local data store. The accelerator system may use heuristics todetermine which result sets to cache when constrained by availablestorage space. From time to time, the accelerator system may invalidatecached results sets (e.g., in response to specified types of changes tothe data from which they were derived) and remove those results setsfrom the data store.

One aspect of a present invention embodiment is to reduce response timesand processing resources required on a database accelerator system. Theresponse time for a cached query is reduced by the amount of time ittakes the accelerator system to execute the query minus the amount oftime it takes to retrieve the cached result set from the data store. Forexample, the response time for a query may be reduced from sixty minutesto a few seconds. Common repeated queries take three to five minutes toprocess, which may be reduced to less than a second, depending on thesize of the result set. Typical response time reductions may be on theorder of 98% for a cached accelerated query.

Another aspect of a present invention embodiment is to improveperformance with regard to database queries driven by reporting tools(e.g., web-based reports, CRYSTAL REPORTS®, etc.). For example, anorganization may generate reports on a yearly, quarterly, and/or monthlybasis. When each report is announced, it may be accessed and generateddynamically by members of each of several departments within theorganization. As a result, the same query or queries are submittedrepeatedly to a database. Many queries distributed to acceleratorsystems arise in this manner. Caching the results may avoid repeatedquery execution that consumes costly resources on the accelerator andslows down or defers other accelerated query executions.

Still another aspect of a present invention embodiment is to cacheresult sets for accelerated queries dynamically and asynchronously.Users submitting queries need not indicate those queries for which theresults are to be cached, nor be aware of changes to the underlyingdata.

An example environment for present invention embodiments is illustratedin FIG. 1. Specifically, the environment includes one or more client orend-user systems 110, one or more database server systems 120, and oneor more database accelerator systems 130. Client systems 110 anddatabase server systems 120 may be remote from each other andcommunicate over a network 12. Database server systems 120 andaccelerator systems 130 may communicate via a local data link 14.Network 12 may be implemented by any number of any suitablecommunications media (e.g., wide area network (WAN), local area network(LAN), Internet, intranet, etc.). Alternatively, any combination of anynumbers of client systems 110, database server systems 120, andaccelerator systems 130 may be local or remote to each other, andcommunicate via any appropriate network (e.g., network 12) or localcommunication medium (e.g., local area network (LAN), hardwire, wirelesslink, intranet, etc.).

A database server system 120 includes a database management system(DBMS) 122 and database 124 (e.g., a relational database managementsystem and relational database, respectively). The DBMS and/or databasemay be implemented across plural database server systems. Alternatively,the DBMS and/or database may reside on a client system 110 or othercomputer system in communication with the client system.

An accelerator system includes accelerator module 132 and data store134. Data store 134 contains base data 135 (e.g., data loaded into theaccelerator system from database 124) and cached query results 137. Datastore 134 may be implemented, for example, by any type(s) of computerreadable storage media. Typical accelerator systems include largeamounts of inexpensive disk space.

Client systems 110 enable users to communicate with the DBMS (e.g., vianetwork 12). The client systems may present any graphical user (e.g.,GUI, etc.) or other interface (e.g., command line prompts, menu screens,etc.) to receive commands from users and interact with the DBMS and/orother modules or services.

Client systems 110, database server systems 120, and accelerator systems130 may be implemented by any conventional or other computer systemsoptionally equipped with a display or monitor, a base (e.g., includingat least one processor 20, memories 30 and/or internal or externalnetwork interface or communications devices 10 (e.g., modem, networkcards, etc.), optional input devices (e.g., a keyboard, mouse, or otherinput device), and any commercially available and custom software (e.g.,DBMS software, accelerator software, etc). For example, an acceleratorsystem 130 may include an array of computing systems for processing datafor a database query in parallel.

An example parallel processing accelerator system according to anembodiment of the present invention is illustrated in FIG. 2. Inparticular, the accelerator system includes a host system 210, workernodes 220, and data store 134. Host system 210 includes acceleratormodule 132, and communicates (e.g., via data link 14) with DBMS 122,worker nodes 220, and has direct or indirect (e.g., via work nodes 220)access to data store 134. In one embodiment, host system 210 isimplemented by a conventional computer system, worker nodes 220 areimplemented by blade servers, and data store 134 is implemented by anarray of data storage devices 230. Host system 210 and worker nodes 220each include one or more processor(s) 20, memories 30, and internal orexternal network interface or communications devices 10. Each workernode may be associated with one or more storage units 230 and dedicatedhardware (e.g., a field-programmable gate array (FPGA)) (not shown) fordata decompression, data filtering, and the like.

Accelerator module 132 may include one or more modules or units toperform the various functions of present invention embodiments describedbelow (e.g., loading data into the accelerator system, updating data inthe accelerator system, applying queries against data in the acceleratorsystem, determining results to cache, storing results, returning cachedresults, invalidating cached results, removing cached results, etc.),may be implemented by any combination of any quantity of software and/orhardware modules or units, and may reside within memory 30 ofaccelerator system 130 (e.g., within memory 30 of host system 210) forexecution by processor 20.

Initially, some or all of the information from database 124 is loadedinto accelerator system 130. For example, a database administrator ormanager may specify tables or parts of tables to be sent from database124 to accelerator system 130. The data is received at the acceleratorsystem (e.g., by host system 210) and written (e.g., via worker nodes220) to data store 134 to form base data 135. Base data 135 may have adifferent format than data stored in database 124 (e.g., base data 135may be compressed). From time to time, the data loaded into theaccelerator may be updated. For example, some or all tables in the basedata 135 may be replaced entirely with a new snapshot of informationfrom database 124. Alternatively, changes to database 124 may bepropagated incrementally to the base data 135.

When DBMS 122 receives a query (e.g., from client system 110 via network12), the DBMS determines whether to direct the query to the acceleratorsystem. For example, if the required data has been loaded into theaccelerator system, and the accelerator system is capable of performingthe required operations, the DBMS may send the query to the acceleratorsystem. A user who submits a query to the database server system neednot be aware of whether the query is processed on the accelerator systemor on the database server system itself.

An example manner of handling a query on an accelerator system accordingto an embodiment of the present invention is illustrated in FIG. 3.Initially, accelerator module 132 receives a query from database serversystem 120 (e.g., via data link 14) at step 310. At step 320, theaccelerator module determines whether valid cached results 137 for thequery exist within data store 134. For example, the received query maybe in the form of a structured query language (SQL) statement, and theaccelerator module may look for a string matching that SQL statement ina list of queries previously processed by the accelerator system. If amatch is found, the accelerator module may verify that valid cachedresults 137 for the previously processed query reside in data store 130.For example, the accelerator module may check that a file containing theresults exists within the data store and has not been marked invalid(e.g., because of changes to the underlying data since the previousquery was processed). If valid results for the query exist within thedata store, the accelerator module accesses those results and returnsthem to DBMS 122 at step 330.

If valid results for the query do not exist within the data store,results for the query are generated by processing part or all of basedata 135 at step 340. For example, host system 210 may partitionprocessing for the query into one or more jobs, compile each job intomachine executable code, and distribute the code to one or more workernodes 220 to be executed in parallel. Each worker node reads therequired base data from its associated storage unit(s) 230, performsparallelizable operations of the query (e.g., filtering, computingpartial sums, etc.), and returns data to the accelerator module on thehost system. The accelerator module may collate this data as necessaryto form a result set for the query.

At step 350, the accelerator module returns the generated result set toDBMS 122, and updates the cached results in the data store (e.g., bywriting the generated result set to a file and optionally deleting oldresults) at step 350. The accelerator module may update the cachedresults asynchronously to generating and returning results to the DBMS.For example, the accelerator system may buffer the results in memory andwrite them to a file in the data store after returning them to the DBMS.Alternatively, the accelerator system may write results to the datastore concurrently or partially concurrently (e.g., via a separateoptionally lower priority process or thread) to returning the results tothe DBMS.

An example manner of updating cached results in the data store of anaccelerator system according to an embodiment of the present inventionis illustrated in FIG. 4. Initially, at step 410, the accelerator moduledetermines whether the newly generated results for the current querywill fit within available space for cached results in the data store.The available space may be a user-configurable portion (e.g., apercentage, fixed amount, etc.) of the data store allocated for cachingquery results. A user may specify that the available portion is zero todisable caching of results. If the results will fit within the availablespace, the accelerator module writes the results to the data store atstep 420. For example, the results may be written to a file, stored in adatabase, or the like. At step 430, the accelerator module saves anindication that results for the current query have been cached in thedata store. For example, the query may be stored in a list of querieshaving cached results, or the query may be flagged as having cachedresults in a list of previously processed queries.

If the accelerator module determines at step 410 that the results willnot fit within the available space, the accelerator module determines atstep 440 which result sets to keep in the data store. For example, theaccelerator module may omit writing a newly generated result set to thedata store if there is insufficient available space. Alternatively, theaccelerator module may delete older cached result sets from the datastore (e.g., in the order in which they were generated or the time sincethey were most recently accessed) until sufficient space is available tostore the new result set. In general, the accelerator module may use anyheuristics (e.g., based on the complexity of the underlying query, ageof the result set, frequency of access, size of the result set, etc.) todetermine which result sets to add, keep, or remove from the cache. Forexample, the accelerator module may delete older cached result sets fromthe data store as necessary if the current query took more than apredetermined amount of time to process (e.g., 1 cpu second, 1 minute,etc.) and the result sets to be deleted from the data store have eachbeen accessed with less than a predetermined average frequency (e.g.,once per hour over the past day, once per day over the past hour, etc.).Determination of the result sets to maintain in the cache may useestimates of performance for different cache contents based on accessmodels, trial and error, machine optimization techniques, etc.

At step 450, the accelerator module determines whether the group ofresult sets to be cached includes the current, newly generated resultset. If not, the current result set is discarded and processing ends.Otherwise, at step 460, one or more previously cached result sets aredeleted from the data store to make room for the current result set, andprocessing proceeds to step 420.

An example manner of invalidating cached results in response to anupdate of the base data on an accelerator system according to anembodiment of the present invention is illustrated in FIG. 5. Initially,the accelerator module determines whether the update is a bulk update oran incremental update at step 510. A bulk update may, for example,replace a database table entirely, whereas an incremental update may,for example, add, delete, or update rows of a database table. In thecase of a bulk update, the accelerator module marks invalid all cachedresult sets derived from the affected data at step 520. For example, theaccelerator module may determine affected queries by examining eachquery in a list of queries for which the results are cached, determinethe names of tables accessed by the query, and compare those table namesto the names of tables included in the bulk update. For each affectedquery, the accelerator module may mark the cached result set invalid by,for example, setting a flag in the list queries, writing an indicator tothe data store (e.g., changing the name of the file containing theresult set, writing to a persistent list of invalid result sets, etc.),or the like. Result sets marked invalid are deleted synchronously orasynchronously from the data at step 530. For example, the acceleratormodule may delete the files promptly or schedule them for deletion at alater time. Alternatively, a separate process or thread may periodicallypurge result sets marked for deletion.

In the case of an incremental update, the accelerator module (or aseparate update process) may record relative degrees of changes to thebase data at step 540. For example, the date and time of the update andthe percentage of rows changed in each table may be stored. At step 550,the accelerator module computes a measure of the changes to theunderlying data for a cached result set since the result set wasgenerated. For example, for each table underlying a cached result set,the accelerator module may sum the percentage changes to the table sincethe query was processed. The maximum of these changes for tablesunderlying the cached result set may be the measure of changes. At step550, the accelerator module compares the measure of changes to apredetermined threshold. For example, the maximum summed percentagechange to a table underlying the result set may be compared to apredetermined threshold percentage value (e.g., 0.1%, 1%, 5%, etc.). Ifthe measure of changes exceeds the predetermined threshold, the resultset is marked invalid at step 570. At step 580, the accelerator moduledetermines whether another cached result set remains to be tested forvalidity. If so, processing returns to step 550. Otherwise, processingproceeds to step 530.

It will be appreciated that the embodiments described above andillustrated in the drawings represent only a few of the many ways ofimplementing embodiments for caching accelerated database query results.

The environment of the present invention embodiments may include anynumber of computer or other processing systems (e.g., client or end-usersystems, server systems, etc.) and storage systems (e.g., file systems,databases, or other repositories), arranged in any desired fashion,where the present invention embodiments may be applied to any desiredtype of computing environment (e.g., cloud computing, client-server,network computing, mainframe, stand-alone systems, etc.). The computeror other processing systems employed by the present inventionembodiments may be implemented by any number of any personal or othertype of computer or processing system (e.g., desktop, laptop, PDA,mobile devices, etc.), and may include any commercially availableoperating system and any combination of commercially available andcustom software (e.g., database software, communications software,etc.). These systems may include any types of monitors and input devices(e.g., keyboard, mouse, voice recognition, touch screen, etc.) to enterand/or view information.

The various functions of the computer or other processing systems may bedistributed in any manner among any number of software and/or hardwaremodules or units, processing or computer systems and/or circuitry, wherethe computer or processing systems may be disposed locally or remotelyof each other and communicate via any suitable communications medium(e.g., LAN, WAN, intranet, Internet, hardwire, modem connection,wireless, etc.). For example, the functions of the present inventionembodiments may be distributed in any manner among various serversystems, end-user/client and/or any other intermediary processingdevices including third party client/server processing devices. Thesoftware and/or algorithms described above and illustrated in the flowcharts may be modified in any manner that accomplishes the functionsdescribed herein. In addition, the functions in the flow charts ordescription may be performed in any order that accomplishes a desiredoperation.

The communication network may be implemented by any number of any typesof communications network (e.g., LAN, WAN, Internet, Intranet, VPN,etc.). The computer or other processing systems of the present inventionembodiments may include any conventional or other communications devicesto communicate over the network via any conventional or other protocols.The computer or other processing systems may utilize any type ofconnection (e.g., wired, wireless, etc.) for access to the network.Local communication media may be implemented by any suitablecommunication media (e.g., local area network (LAN), hardwire, wirelesslink, Intranet, etc.).

The system may employ any number of data storage systems and structuresto store information. The data storage systems may be implemented by anynumber of any conventional or other databases, file systems, caches,repositories, warehouses, etc.

The present invention embodiments may employ any number of any type ofuser interface (e.g., Graphical User Interface (GUI), command-line,prompt, etc.) for obtaining or providing information, where theinterface may include any information arranged in any fashion. Theinterface may include any number of any types of input or actuationmechanisms (e.g., buttons, icons, fields, boxes, links, etc.) disposedat any locations to enter/display information and initiate desiredactions via any suitable input devices (e.g., mouse, keyboard, touchscreen, pen, etc.).

It is to be understood that the software of the present inventionembodiments could be developed by one of ordinary skill in the computerarts based on the functional descriptions contained in the specificationand flow charts illustrated in the drawings. Further, any referencesherein of software performing various functions generally refer tocomputer systems or processors performing those functions under softwarecontrol. The computer systems of the present invention embodiments mayalternatively be implemented by any type of hardware and/or otherprocessing circuitry.

The present invention embodiments are not limited to the specific tasks,algorithms, parameters, data, or network/environment described above,but may be utilized for caching any type of accelerated query results(e.g., queries generated by reporting software, ad hoc queries,relational or other database queries, online analytical processing(OLAP) queries, document search engine queries, etc.).

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of the invention. Asused herein, the singular forms “a”, “an” and “the” are intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. It will be further understood that the terms “comprises”,“comprising”, “includes”, “including”, “has”, “have”, “having”, “with”and the like, when used in this specification, specify the presence ofstated features, integers, steps, operations, elements, and/orcomponents, but do not preclude the presence or addition of one or moreother features, integers, steps, operations, elements, components,and/or groups thereof.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below are intended toinclude any structure, material, or act for performing the function incombination with other claimed elements as specifically claimed. Thedescription of the present invention has been presented for purposes ofillustration and description, but is not intended to be exhaustive orlimited to the invention in the form disclosed. Many modifications andvariations will be apparent to those of ordinary skill in the artwithout departing from the scope and spirit of the invention. Theembodiment was chosen and described in order to best explain theprinciples of the invention and the practical application, and to enableothers of ordinary skill in the art to understand the invention forvarious embodiments with various modifications as are suited to theparticular use contemplated.

The descriptions of the various embodiments of the present inventionhave been presented for purposes of illustration, but are not intendedto be exhaustive or limited to the embodiments disclosed. Manymodifications and variations will be apparent to those of ordinary skillin the art without departing from the scope and spirit of the describedembodiments. The terminology used herein was chosen to best explain theprinciples of the embodiments, the practical application or technicalimprovement over technologies found in the marketplace, or to enableothers of ordinary skill in the art to understand the embodimentsdisclosed herein.

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium baying instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions furimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

What is claimed is:
 1. A system for processing a database querycomprising: at least one processor and a data store, wherein the atleast one processor is configured to: process one or more first databasequeries against a data set to produce corresponding result sets; storeone or more result sets for the one or more first database queries inthe data store; determine an amount of data changed within the data setfor an update applied to data of the data set after processing the oneor more first database queries and discarding one or more stored resultsets associated with the changed data in response to the amount ofchanged data exceeding a threshold amount of changed data, whereindiscarding one or more stored result sets includes: discarding allstored result sets derived from changed data in response to a bulkupdate applying changes to entireties of database objects; anddiscarding one or more result sets based on the amount of changed datain response to an incremental update applying changes to elements of thedatabase objects; receive and process a second database query, whereinprocessing the second database query comprises: comparing the seconddatabase query to the one or more first database queries to determineprevious processing of the second database query and presence of acorresponding result set in the data store for the second databasequery; and reducing a response time of the at least one processor forprocessing the second database query by providing the correspondingresult set from the data store as results for the second database queryto avoid repeated query execution based on the comparison indicating thesecond database query has been previously processed.
 2. The system ofclaim 1, wherein the one or more first database queries and the seconddatabase query are processed by a database accelerator.
 3. The system ofclaim 1, wherein the threshold amount of changed data includes auser-specified threshold.
 4. The system of claim 1, wherein providingthe corresponding result set from the data store includes: providing thecorresponding result set from the data store in response to the seconddatabase query matching a previously processed one of the first databasequeries.
 5. The system of claim 1, wherein the data store includes acache that is allocated a user-specified portion of disk space.
 6. Thesystem of claim 1, wherein storing the one or more result sets comprisesdetermining available space in the data store.
 7. The system of claim 6,wherein determining available space in the data store comprisesdiscarding a result set.
 8. A computer program product for processing adatabase query comprising: a computer readable storage medium havingcomputer readable program code embodied therewith for execution on aprocessing system including at least one processor and a data store, thecomputer readable program code comprising computer readable program codeconfigured to cause the at least one processor to: process one or morefirst database queries against a data set to produce correspondingresult sets; store one or more result sets for the one or more firstdatabase queries in the data store; determine an amount of data changedwithin the data set for an update applied to data of the data set afterprocessing the one or more first database queries and discarding one ormore stored result sets associated with the changed data in response tothe amount of changed data exceeding a threshold amount of changed data,wherein discarding one or more stored result sets includes: discardingall stored result sets derived from changed data in response to a bulkupdate applying changes to entireties of database objects; anddiscarding one or more result sets based on the amount of changed datain response to an incremental update applying changes to elements of thedatabase objects; receive and process a second database query, whereinprocessing the second database query comprises: comparing the seconddatabase query to the one or more first database queries to determineprevious processing of the second database query and presence of acorresponding result set in the data store for the second databasequery; and reducing a response time of the at least one processor forprocessing the second database query by providing the correspondingresult set from the data store as results for the second database queryto avoid repeated query execution based on the comparison indicating thesecond database query has been previously processed.
 9. The computerprogram product of claim 8, wherein the one or more first databasequeries and the second database query are processed by a databaseaccelerator.
 10. The computer program product of claim 8, wherein thethreshold amount of changed data includes a user-specified threshold.11. The computer program product of claim 8, wherein providing thecorresponding result set from the data store includes: providing thecorresponding result set from the data store in response to the seconddatabase query matching a previously processed one of the first databasequeries.
 12. The computer program product of claim 8, wherein the datastore includes a cache that is allocated a user-specified portion ofdisk space.
 13. The computer program product of claim 8, wherein storingthe one or more result sets comprises determining available space in thedata store.
 14. The computer program product of claim 13, whereindetermining available space in the data store comprises discarding aresult set.